Maximum Induced Subgraph of an Augmented Cube

نویسنده

  • Jheng-Cheng Chen
چکیده

Let ) (m max G ξ denote the maximum number of edges in a subgraph of graph G induced by m nodes. The n -dimensional augmented cube, denoted as n AQ , a variation of the hypercube, possesses some properties superior to those of the hypercube. We study the cases when G is the augmented cube n AQ . In this paper, we show that i p i r i n AQ i p m max )2 2 1 2 ( = ) ( 0 = − + ∑ ξ , where r p p p > > > 1 0 are nonnegative integers defined by i p r i m 2 = 0 = ∑ and 2 ≥ m . We then apply this formula to find the bisection width of n AQ . Keywords—Interconnection network, Augmented cube, Induced subgraph, Bisection width.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On induced subgraphs of the cube

Consider the usual graph Q " defined by the n-dimensional cube (having 2 " ver-tices and n2 "-' edges). We prove that if G is an induced subgraph of Q " with more than 2 "-' vertices then the maximum degree in G is at least (4-o(1)) log n. On the other hand, we construct an example which shows that this is not true for maximum degree larger than & + 1. 0 1988 Academic POW, inc.

متن کامل

The augmented Zagreb index, vertex connectivity and matching number of graphs

Let $Gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. Denote by $Upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. In the classes of graphs $Gamma_{n,kappa}$ and $Upsilon_{n,beta}$, the elements having maximum augmented Zagreb index are determined.

متن کامل

Decomposing infinite matroids into their 3-connected minors

s Elgersburg 2011 Rainbow Cycles in Cube Graphs Jens-P. Bode (Technische Universität Braunschweig) Joint work with A. Kemnitz and S. Struckmann A graph G is called rainbow with respect to an edge coloring if no two edges of G have the same color. Given a host graph H and a guest graph G ⊆ H, an edge coloring of H is called G-anti-Ramsey if no subgraph of H isomorphic to G is rainbow. The anti-R...

متن کامل

The (non-)existence of perfect codes in Lucas cubes

A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...

متن کامل

On disjoint hypercubes in Fibonacci cubes

The Fibonacci cube of dimension n, denoted as Γn, is the subgraph of n-cube Qn induced by vertices with no consecutive 1’s. We study the maximum number of disjoint subgraphs in Γn isomorphic to Qk, and denote this number by qk(n). We prove several recursive results for qk(n), in particular we prove that qk(n) = qk−1(n − 2) + qk(n − 3). We also prove a closed formula in which qk(n) is given in t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014